Generalized Continuation Newton Methods and the Trust-Region Updating Strategy for the Underdetermined System
نویسندگان
چکیده
This paper considers the generalized continuation Newton method and trust-region updating strategy for underdetermined system of nonlinear equations. Moreover, in order to improve its computational efficiency, new will not update Jacobian matrix when current performs well. The numerical results show that is more robust faster than traditional optimization such as Levenberg–Marquardt (a variant methods, built-in subroutine fsolve.m MATLAB R2020a environment). time about 1/8 1/50 fsolve. Furthermore, it also proves global convergence local superlinear under some standard assumptions.
منابع مشابه
A New Strategy for Choosing the Radius Adjusting Parameters in Trust Region Methods
Trust region methods are a class of important and efficient methods for solving unconstrained optimization problems. The efficiency of these methods strongly depends on the initial parameter, especially radius adjusting parameters. In this paper, we propose a new strategy for choosing the radius adjusting parameters. Numerical results from testing the new idea to solve a class of unconstrained ...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولThe generalized trust region subproblem
The interval bounded generalized trust region subproblem (GTRS) consists in minimizing a general quadratic objective, q0(x) → min, subject to an upper and lower bounded general quadratic constraint, l ≤ q1(x) ≤ u. This means that there are no definiteness assumptions on either quadratic function. We first study characterizations of optimality for this implicitly convex problem under a constrain...
متن کاملQuasi - Newton Trust - Region Method
The classical trust-region method for unconstrained minimization can be augmented with a line search that finds a point that satisfies the Wolfe conditions. One can use this new method to define an algorithm that simultaneously satisfies the quasi-Newton condition at each iteration and maintains a positive-definite approximation to the Hessian of the objective function. This new algorithm has s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2021
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-021-01566-0